The formulas for the number of spanning trees in circulant graphs
نویسندگان
چکیده
lim n→∞ T C s1,s2,...,sk,⌊ n d1 ⌋+e1,⌊ n d2 ⌋+e2,...,⌊ n dl ⌋+el n 1 n , as a function of si, dj and ek, where T (G) is the number of spanning trees in graph G. In this paper we derive simple and explicit formulas for the number of spanning trees in circulant graphs C12l pn . Following from the formulas we show that lim n→∞ T C1,a1n,a2n,...,aln pn 1 n
منابع مشابه
Further analysis of the number of spanning trees in circulant graphs
Let 1 s1<s2< · · ·<sk n/2 be given integers. An undirected even-valent circulant graph, C12k n , has n vertices 0, 1, 2, . . ., n− 1, and for each si (1 i k) and j (0 j n− 1) there is an edge between j and j + si (mod n). Let T (C12k n ) stand for the number of spanning trees of C12k n . For this special class of graphs, a general and most recent result, which is obtained in [Y.P. Zhang, X.Yong...
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملChebyshev polynomials and spanning tree formulas for circulant and related graphs
Kirchhoo's Matrix Tree Theorem permits the calculation of the number of spanning trees in any given graph G through the evaluation of the determinant of an associated matrix. In the case of some special graphs Boesch and Prodinger 9] have shown how to use properties of Chebyshev polyno-mials to evaluate the associated determinants and derive closed formulas for the number of spanning trees of g...
متن کاملN ov 2 01 7 The number of spanning trees in circulant graphs , its arithmetic properties and asymptotic
In this paper, we develop a new method to produce explicit formulas for the number τ(n) of spanning trees in the undirected circulant graphs Cn(s1, s2, . . . , sk) and C2n(s1, s2, . . . , sk, n). Also, we prove that in both cases the number of spanning trees can be represented in the form τ(n) = p n a(n), where a(n) is an integer sequence and p is a prescribed natural number depending only of p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 338 شماره
صفحات -
تاریخ انتشار 2015